ModGen: Theorem Proving by Model Generation

ModGen (Model Generation) is a complete theorem prover for rst order logic with nite Herbrand domains. ModGen takes rst order formulas as input, and generates models of the input formulas. ModGen consists of two major modules: a module for transforming the input formulas into propositional clauses, and a module to nd models of the propositional clauses. The rst module can be used by other researchers so that the SAT problems can be easily represented , stored and communicated. An important issue in the design of ModGen is to ensure that transformed propositional clauses are satissable ii the original formulas are. The second module can be easily replaced by any advanced SAT problem solver. Mod-Gen is easy to use and very eecient. Many problems which are hard for general resolution theorem provers are found easy for ModGen.